Atomicity Policies using Design Patterns

نویسندگان

  • António Rito Silva
  • João Pereira
  • Pedro Sousa
  • José Alves Marques
چکیده

This paper describes three object-oriented design patterns local serialization, global serialization and recovery and their integration to support atomic objects. The paper emphasizes the policies each pattern offers and the heterogeneity of policies resulting from their integration. The policies supported by the patterns include: pessimistic and optimistic serialization; static, dynamic and hybrid global serialization policies; redo, undo, copy and compensating recoverypolicies. The patterns emphasize decoupling of solutions to offer flexible, adaptable and extensible compositions. The patterns allow: decoupling the functional part from the concurrent part; decoupling concurrency control from concurrency generation; decoupling object-specific information from generic algorithms of concurrency control and recovery; decoupling global serialization policies from local serialization policies; and decoupling concurrency control from recovery.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

WebPern: An Extensible Transaction Server for the World Wide Web

Concurrency control is a well-known problem in collaborative hypermedia system design and implementation. Existing systems store data and links in databases (link servers or hyperbases) that have built-in concurrency control polices such as serializability and atomicity, usually implemented using locking. Whereas it is desirable to construct collaborative hypermedia systems on top of the World ...

متن کامل

Static Analysis of Atomicity for Algorithms Using Non-Blocking Synchronization∗

In concurrent programming, non-blocking synchronization is very efficient but difficult to design correctly. This paper presents a static analysis to show that code blocks using non-blocking synchronization are atomic, i.e., that every execution of the program is equivalent to one in which those code blocks execute without interruption by other threads. Our analysis determines commutativity of ...

متن کامل

Towards a Framework for Modeling Business Compensation Processes

A typical e-business transaction takes hours or days to complete, involves a number of partners, and comprises many failure points[8]. With short-lived transactions, database systems ensure atomicity by either committing all of the elements of the transaction, or by canceling all of them in case of a failure. With typical e-business transactions, strict atomicity is not practical, and we need a...

متن کامل

Design of Dynamic Detector for Atomicity Races in ARINC-653 Applications

This paper presents a dynamic detector, called Race-653 that locates atomicity races in ARINC-653 applications using an on-the-fly analysis technique. Race-653 consists of 653-Monitor and 653-Detector modules. The 653-Monitor collects monitored information during an execution of the applications, such as processes, semaphores, and accesses for each shared resource. The 653-Detector reports atom...

متن کامل

Revisiting Atomic Patterns for Scalar Multiplications on Elliptic Curves

This paper deals with the protection of elliptic curve scalar multiplications against side-channel analysis by using the atomicity principle. Unlike other atomic patterns, we investigate new formulæ with same cost for both doubling and addition. This choice is particularly well suited to evaluate double scalar multiplications with the Straus-Shamir trick. Since fixed point multiplications highl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996